A Dynamic Logic for Unstructured Programs with Embedded Assertions
نویسنده
چکیده
We present a program logic for an intermediate verification programming language and provide formal definitions of its syntax and semantics. The language is unstructured, indeterministic, and has embedded assertions. A set of sound rewrite rules which allow symbolic execution of programs is given. We prove the soundness of three inference rules using invariants which can be used to deal with loops during the verification.
منابع مشابه
A Framework for Assertion - based Debuggingin Constraint Logic
We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of programs. We deene assertion schemas which allow writing (partial) speciications for constraint logic programs using quite general properties, including user-deened programs. The framework is aimed at detecting deviations of the ...
متن کاملA Framework for Assertion-Based Debugging in Constraint Logic Programming
A b s t r a c t . We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of programs. We define assertion schemas which allow writing (partial) specifications for constraint logic programs using quite general properties, including user-defined programs. The framework is aimed at detecti...
متن کاملThe Taming of Converse: Reasoning about Two-way Computations
We consider variants o f propositional dynamic logic (PDL) augmented with the converse construct. Intuitively, the converse a of a program a is a programs whose semantics is to run a backwards. While PDL consists o f assertions about weakest preconditions, the converse construct enable us to make assertions about strongest postconditions. We investigate the interaction of converse with two cons...
متن کاملReview of Dynamic Logic
In the 1960s, as programming languages were being used to write larger programs, those programs became harder to understand, and people began to worry about issues such as correctness, that is, determining whether a program computed what it was supposed to compute. As a consequence, researchers started to look into the pragmatics of programming, leading among others to a criticism of the GOTO s...
متن کاملAction Logic and Pure Induction bY
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions whose truth is evaluated along intervals instead of at states. Action logic is an equational theory ACT conservatively extending the equational theory REG of regular expressions with operations preimplication a+b (had ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010